منابع مشابه
Machine Translation Using Probabilistic Synchronous Dependency Insertion Grammars
Syntax-based statistical machine translation (MT) aims at applying statistical models to structured data. In this paper, we present a syntax-based statistical machine translation system based on a probabilistic synchronous dependency insertion grammar. Synchronous dependency insertion grammars are a version of synchronous grammars defined on dependency trees. We first introduce our approach to ...
متن کاملDependency Grammars and Context-Free Grammars
The question arises from time to time what the relation is between dependency grammars (DG’s) and phrase-structure grammars. A classic paper by Gaifman [1] would appear to have laid the issue to rest, by proving that dependency grammars are a special case of context-free grammars (CFG’s). Gaifman proves that dependency grammars are equivalent to a proper subset of phrasestructure grammars, thos...
متن کاملCategorial dependency grammars
Categorial Dependency Grammars (CDG) introduced in this paper express projective and distant dependencies in classical categorial grammar terms. They treat order constraints in terms of oriented polarized valencies and a bounded commutativity rule. CDGs are expressive, constitute a convenient frame for coupling dependency grammars with linguistic semantics, and with all this, they are parsed in...
متن کاملGeneralized Categorial Dependency Grammars
Generalized Categorial Dependency Grammars (gCDG) studied in this paper are genuine categorial grammars expressing projective and discontinuous dependencies, stronger than CF-grammars and nonequivalent to mild context-sensitive grammars. We show that gCDG are parsed in polynomial time and enjoy good mathematical properties.
متن کاملDependency Structure Grammars
In this paper, we define Dependency Structure Grammars (DSG), which are rewriting rule grammars generating sentences together with their dependency structures, are more expressive than CF-grammars and non-equivalent to mildly context-sensitive grammars. We show that DSG are weakly equivalent to Categorial Dependency Grammars (CDG) recently introduced in [6, 3]. In particular, these dependency g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.11.012